On 2-adjacency Relation of Links
نویسندگان
چکیده
In this note, we give some examples of links having 2-adjacency relation and we also report a recent study of 2-bridge links with 2-adjacency relation by the author.
منابع مشابه
THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملIntersection Graphs for String Links
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graphs, and show that these weight systems are related to the weight systems induced by the Conway and Homfly polynomials.
متن کاملDegree and Principal Eigenvectors in Complex Networks
The largest eigenvalue λ1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the principal eigenvector corresponding to the largest e...
متن کاملOpposite Relation on Dual Polar Spaces and Half-spin Grassmann Spaces
We characterize the collinearity (adjacency) relation of dual polar spaces and half-spin Grassmann spaces in terms of the relation to be opposite in the corresponding collinearity graphs. Our characterization is closely related with results given [1] and [2].
متن کاملSome Combinatorial Aspects of Composition of a Set of Functions
Additionally, we make an assumption that Ai are non-empty sets, for i=0, 1, . . . ,m, where m=[n/2]. For each set of functions An we determine the number of meaningful compositions of higher order in implicit and explicit form. Let us define a binary relation ρ ”to be in composition” with ∇iρ∇j = 1 iff the composition ∇j ◦∇i is meaningful for i, j ∈ {1, 2, . . . , n}. Let us form an adjacency m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007